The Multiple-Recursive Matrix Method for Pseudorandom Number Generation
نویسندگان
چکیده
منابع مشابه
Pseudorandom Vector Generation by the Multiple-recursive Matrix Method
Pseudorandom vectors are of importance for parallelized simulation methods. In this paper we carry out an in-depth analysis of the multiplerecursive matrix method for the generation of uniform pseudorandom vectors which was introduced in an earlier paper of the author. We study, in particular, the periodicity properties, the lattice structure, and the behavior under the serial test for sequence...
متن کاملA note on the multiple-recursive matrix method for generating pseudorandom vectors
The multiple-recursive matrix method for generating pseudorandom vectors was introduced by Niederreiter (Linear Algebra Appl. 192 (1993), 301-328). We propose an algorithm for finding an efficient primitive multiplerecursive matrix method. Moreover, for improving the linear complexity, we introduce a tweak on the contents of the primitive multiple-recursive matrix method.
متن کاملParallel Pseudorandom Number Generation
Monte Carlo applications are widely perceived as embarrassingly parallel. (Monte Carlo enthusiasts prefer the term “naturally parallel” to the somewhat derogatory “embarrassingly parallel” coined by computer scientists.) The truth of this notion depends, to a large extent, on the quality of the parallel random number generators used. It is widely assumed that with N processors executing N copie...
متن کاملLayered Cellular Automata for Pseudorandom Number Generation
The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA with L additional layers of memory registers, has simple local interconnections and high operating speed. The time-varying L-LCA transformation at each clock can be reduced to a single transformation in the set { | 1, 2, , 2 1} f n A f = − ... formed by the transformation matrix A of a maximum length Cellular Automata ...
متن کاملConfigurable Cellular Automata for Pseudorandom Number Generation
This paper proposes a generalized structure of cellular automata (CA) – the configurable cellular automata (CoCA). With selected properties from programmable CA (PCA) and controllable CA (CCA), a new approach to cellular automata is developed. In CoCA, the cells are dynamically reconfigured at run-time via a control CA. Reconfiguration of a cell simply means varying the properties of that cell ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 1995
ISSN: 1071-5797
DOI: 10.1006/ffta.1995.1002